1 M ay 2 00 4 Estimates on the Lower Bound of the First Gap ∗
نویسنده
چکیده
We give a lower bound for the first gap λ2 − λ1 of the Dirichlet eigenvalues of the Schrödinger operator on a bounded convex domain Ω in a class of Riemannian manifolds, namely λ2 − λ1 ≥ π diameter(Ω) + ( 12 π − 1)α. For the Laplacian on disks in Rn, we have λ2 − λ1 ≥ 4 3 π diameter(Ω) .
منابع مشابه
A pr 2 00 4 Estimates on the Lower Bound of the First Gap ∗
We give a lower bound for the first gap λ2 − λ1 of the Dirichlet eigenvalues of the Schrödinger operator on a bounded convex domain Ω in a class of Riemannian manifolds, namely λ2 − λ1 ≥ π diameter(Ω) + ( 12 π − 1)α. For the Laplacian on disks in Rn, we have λ2 − λ1 ≥ 4 3 π diameter(Ω) .
متن کاملJ an 2 00 5 Estimates on the Lower Bound of the First Gap ∗
We give a new lower bound for the first gap λ2−λ1 of the Dirichlet eigenvalues of the Schrödinger operator on a bounded convex domain Ω in Rn or Sn and greatly sharpens the previous estimates. The new bound is explicit and computable.
متن کاملthe effect of household's income gap on children's educational gap whit emphasize on demographic factors
one of the problems of human societies is depriving people, especially children, of the healing elixir of education. In Iran, too, statistics comparing the academic performance of students on both sides of the income spectrum indicate that the educational gap is clearly visible along the income gap. In other words, along with the income poverty of parents, children also benefit from lower level...
متن کاملامید ریاضی نرخ پوشش برای ماتریس‌های هلمن
Hellman’s time-memory trade-off is a probabilistic method for inverting one-way functions, using pre-computed data. Hellman introduced this method in 1980 and obtained a lower bound for the success probability of his algorithm. After that, all further analyses of researchers are based on this lower bound. In this paper, we first studied the expected coverage rate (ECR) of the Hellman matrice...
متن کامل8 M ay 2 00 8 Square - Difference - Free Sets of Size Ω ( n 0 . 7334
A set A ⊆ N is square-difference free (henceforth SDF) if there do not exist x, y ∈ A, x 6= y, such that |x − y| is a square. Let sdf(n) be the size of the largest SDF subset of {1, . . . , n}. Ruzsa has shown that sdf(n) = Ω(n65 ) = Ω(n0.733077···) We improve on the lower bound by showing sdf(n) = Ω(n205 ) = Ω(n0.7334···) As a corollary we obtain a new lower bound on the quadratic van der Waer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004